Complexity classes - PDFSEARCH.IO - Document Search Engine

Complexity classes
Results: 1120

#	Item
961	Axiomatising physical experiments as oracles to algorithms Edwin J. Beggsa , Jos´e F´elix Costab∗ , and John V. Tuckerc a Department of Mathematics, College of Sciences, Swansea University, Swansea SA2 8PP, Wales, Un Add to Reading List Source URL: www-compsci.swan.ac.uk Language: English - Date: 2012-04-11 07:58:28 Computability theory Complexity classes Models of computation Alan Turing Oracle machine Turing reduction John V. Tucker Probabilistic Turing machine Reduction Theoretical computer science Applied mathematics Computational complexity theory
962	NAACL2001 Chunking with Support Vector Machines Add to Reading List Source URL: chasen.org Language: English - Date: 2002-01-12 17:42:12 Cognition Chunking Mnemonics Support vector machine Complexity classes Vector space Phrase chunking NP Linear classifier Algebra Mathematics Statistical classification
963	PDF Document Add to Reading List Source URL: chasen.org Language: English - Date: 2002-01-12 17:50:18 Linguistics NP Part-of-speech tagging Artificial intelligence Applied mathematics Statistical classification Complexity classes Support vector machine
964	Control in the Presence of Manipulators: Cooperative and Competitive Cases Zack 1 Fitzsimmons, Add to Reading List Source URL: www.cs.rochester.edu Language: English - Date: 2013-07-28 10:49:33 P Complexity classes Polynomial hierarchy NP-hard
965	Book review of Descriptive Complexity by Neil Immerman (Graduate texts in Computer Science, Springer, [removed]Appeared in the Bulletin of Symbolic Logic vol. 7 no. 4 December, 2001 pages[removed]Overview Add to Reading List Source URL: www.haverford.edu Language: English - Date: 2012-03-28 11:42:06 Finite model theory Computational complexity theory Descriptive complexity Structural complexity theory Descriptive complexity theory Mathematical logic P versus NP problem FO P Theoretical computer science Applied mathematics Complexity classes
966	A Purely Logical Characterization of Circuit Uniformity (Extended Draft) Steven Lindell † Add to Reading List Source URL: www.haverford.edu Language: English - Date: 2013-03-11 14:31:15 Complexity classes Model theory Circuit complexity Predicate logic Semantics FO BIT predicate AC0 Predicate Theoretical computer science Mathematics Applied mathematics
967	PCMI Thursday, July 13, 2010 Add to Reading List Source URL: www.math.hmc.edu Language: English - Date: 2010-08-26 17:00:16 P Complexity classes Polynomial UP
968	The Complexity of Theorem-Proving Procedures Stephen A. Cook University of Toronto Add to Reading List Source URL: cs.stanford.edu Language: English - Date: 2005-08-23 19:36:17 Complexity classes Computability theory Turing machine Alan Turing Tautology NP FO Reduction PP Theoretical computer science Computational complexity theory Applied mathematics
969	15-854: Approximations Algorithms Topic: Dynamic Programming Scribe: Mihir Kedia Add to Reading List Source URL: www.cs.cmu.edu Language: English - Date: 2005-10-28 08:20:42 Complexity classes Mathematical optimization Operations research NP-complete problems Strongly NP-complete Polynomial-time approximation scheme Job shop scheduling Knapsack problem Optimization problem Theoretical computer science Computational complexity theory Applied mathematics
970	Arithmetic Decision Procedures: a simple introduction Michael Norrish Add to Reading List Source URL: users.cecs.anu.edu.au Language: English - Date: 2003-11-07 00:31:44 Model theory Quantification Complexity classes Predicate logic Quantifier elimination Presburger arithmetic Well-formed formula Arithmetical hierarchy Universal quantification Logic Mathematical logic Mathematics

UPDATE